Indefinite block ciphering based on variable and great length key
نویسندگان
چکیده
منابع مشابه
A New Symmetric-Key Block Ciphering Algorithm
Strong cryptographic algorithms have been used for securing data communication. It is considered as one of the best tools to help people to protect their sensitive information from cryptanalysts when it is stored or transmitted via insecure communication channels. In this paper we present a novel symmetric-key block ciphering algorithm, MJEA (for Modified Jamal Encryption Algorithm). MJEA has a...
متن کاملMessage Based Random Variable Length Key Encryption Algorithm
Problem statement: A block ciphers provides confidentiality in cryptography but cryptanalysis of the classical block ciphers demonstrated some old weaknesses grabbing a partial key in any stage of encryption procedure leads to reconstructing the whole key. Exhaustive key search shows that key generation should be indeterminist and random for each round. Matching cipher-text attack shows that la...
متن کاملDescription of a New Variable-Length Key, 64-bit Block Cipher (Blowfish)
Blowfish, a new secret-key block cipher, is proposed. It is a Feistel network, iterating a simple encryption function 16 times. The block size is 64 bits, and the key can be any length up to 448 bits. Although there is a complex initialization phase required before any encryption can take place, the actual encryption of data is very efficient on large microprocessors. The cryptographic communit...
متن کاملA Key Dependent Encryption Algorithm Based on Multiple Bitwise-Shuffling and XOR Variable-Length Partitions
Email: [email protected] Abstract: This new algorithm employs shuffling procedures combined with variable-length key-dependent XOR and S-box substitutions to perform lossless image encryption. This algorithm was implemented and tested by performing different permutations of shuffling, XOR encryption and S-box substitution. Empirical analysis using different types of test images of different s...
متن کاملA Novel Multiple Key Block Ciphering Mechanism with Reduced Computational Overhead
Cryptanalysis of symmetric key cryptography encourages large key size and complex operations to achieve message confidentiality. All these techniques pose computational overhead at both the sender & receiver ends. In this paper, we propose a simple yet powerful Block Cipher Multiple Key Symmetric Encryption (BCMKSE) algorithm for achieving both confidentiality & integrity with reduced computati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Security and Communication Networks
سال: 2016
ISSN: 1939-0114
DOI: 10.1002/sec.1715